Towards regular languages over in nite alphabets
نویسنده
چکیده
منابع مشابه
Algebraic and Topological Theory of Languages
A language is torsion (resp. bounded torsion, aperiodic, bounded aperiodic) if its syntactic monoid is torsion (resp. bounded torsion, aperiodic, bounded aperiodic). We generalize the regular language theorems of Kleene, Sch utzenberger and Straubing to describe the classes of torsion, bounded torsion, aperiodic and bounded aperiodic languages. These descriptions involve taking limits of sequen...
متن کاملTowards Regular Languages over Infinite Alphabets
Motivated by formal models recently proposed in the context of XML, we study automata and logics on strings over infinite alphabets. These are conservative extensions of classical automata and logics defining the regular languages on finite alphabets. Specifically, we consider register and pebble automata, and extensions of first-order logic and monadic second-order logic. For each type of auto...
متن کاملTowards Nominal Formal Languages (long version)
We introduce formal languages over infinite alphabets where words may contain binders. We define the notions of nominal language, nominal monoid, and nominal regular expressions. Moreover, we extend history-dependent automata (HD-automata) by adding stack, and study the recognisability of nominal languages.
متن کاملTowards Nominal Formal Languages
We introduce formal languages over infinite alphabets where words may contain binders. We define the notions of nominal language, nominal monoid, and nominal regular expressions. Moreover, we extend history-dependent automata (HD-automata) by adding stack, and study the recognisability of nominal languages.
متن کاملState Complexity of Basic Operations on Finite Languages
The state complexity of basic operations on regular languages has been studied in 9{11]. Here we focus on nite languages. We show that the catenation of two nite languages accepted by an m-state and an n-state DFA, respectively, with m > n is accepted by a DFA of (m ? n + 3)2 n?2 ? 1 states in the two-letter alphabet case, and this bound is shown to be reachable. We also show that the tight upp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001